#pragma once
#include <iostream>
#include <vector>
#include <string>
#include <semaphore.h>
using std::cout;
using std::endl;

template <class T>
class RingQueue
{
private:
    void P(sem_t &sem)
    {
        sem_wait(&sem);
    }
    void V(sem_t &sem)
    {
        sem_post(&sem);
    }

    void Lock(pthread_mutex_t &mutex)
    {
        pthread_mutex_lock(&mutex);
    }
    void Unlock(pthread_mutex_t &mutex)
    {
        pthread_mutex_unlock(&mutex);
    }

public:
    RingQueue(int cap) : _cap(cap), _ring_queue(cap), _product_step(0), _consumer_step(0)
    {
        sem_init(&_room_sem, 0, _cap);
        sem_init(&_data_sem, 0, 0);
        pthread_mutex_init(&_productor_mutex, nullptr);
        pthread_mutex_init(&_consumer_mutex, nullptr);
        pthread_cond_init(&_productor_cond,nullptr);
    }

    ~RingQueue()
    {
        sem_destroy(&_room_sem);
        sem_destroy(&_data_sem);
        pthread_mutex_destroy(&_productor_mutex);
        pthread_mutex_destroy(&_consumer_mutex);
        pthread_cond_destroy(&_productor_cond);
    }
    void Enqueue(const T &in)
    {
        // 生产行为
        P(_room_sem);
        // 一定有空间！
        Lock(_productor_mutex);
        //pthread_cond_wait(&_productor_cond,&productor_mutex);
        _ring_queue[_product_step++] = in;
        _product_step %= _cap;
        Unlock(_productor_mutex);
        V(_data_sem);
    }

    void Pop(T *out)
    {
        P(_data_sem);
        Lock(_consumer_mutex);
        *out = _ring_queue[_consumer_step++];
        _consumer_step %= _cap;
        Unlock(_consumer_mutex);
        V(_room_sem);
    }

private:
    // 1. 环形队列
    std::vector<T> _ring_queue; //
    int _cap;                   // 环形队列的容量上限
    // 2. 生产和消费的下标
    int _product_step;
    int _consumer_step;
    // 3.定义信号量
    sem_t _room_sem; // 生产者关心
    sem_t _data_sem; // 消费者关心
    // 4.生产者消费者所用的锁

    pthread_mutex_t _productor_mutex;
    pthread_mutex_t _consumer_mutex;

    pthread_cond_t _productor_cond;
};